Search games
نویسندگان
چکیده
منابع مشابه
Two-sided Search Games
NUMBER 4 A target hides himself in one of the boxes 1,2, ... , m with probability distribution X=<Xl, ... , Xm) and can move to any of other boxes after each unsuccessful search by a searcher. The searcher is not informed of x and continues search until the target is found. He is informed of Ci'S, i.e., examination costs of each box, and ai's, i= 1, ... , m, where ai is the probability of overl...
متن کاملEvaluating Personal Search Using Games
Search in a personal information management (PIM) environment, such as a desktop, is typically evaluated by deploying a system to actual users. These evaluations are expensive and hard to reproduce. As an alternative, in this paper we propose game-style evaluations in which participants complete a set of known-item finding tasks in a competitive environment. Despite limitations, evaluations bas...
متن کاملTaxation search in boolean games
Agents in a Boolean game have a personal goal represented as a propositional logic formula over a set of Boolean variables, where some of these variables are not necessarily held by the agent. The actions available to each agent are assumed to have some cost, and the agent’s secondary goal is to minimize its costs. An interesting problem is to find a taxation scheme that imposes additional cost...
متن کاملQuantum games via search algorithms
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the two possible states. These games are characterized by a continuous space of strategies and the selection of a particular strategy is determined by the momen...
متن کاملFuzzified Tree Search in Real Domain Games
Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best move. Therefore, pruning techniques may be applied earlier resulting in faster search and greater performance. Applied to an abstract domain, it outperforms the existing ones such as Alpha-Beta, PVS, Negascout, NegaC*, SSS*/ Dual* and MTD(f). In this paper we present ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1986
ISSN: 0001-8708
DOI: 10.1016/0001-8708(86)90044-7